A New Lifetime Prediction Algorithm Based Routing For VANETs

نویسنده

  • R. Jemima Ravi
چکیده

In Vehicular ad hoc networks (VANET), a host may exhaust its power or move away without giving any notice to its cooperative nodes, causing changes in network topology, and thus, these changes may significantly degrade the performance of a routing protocol. Several routing protocol studies based on node lifetime and link lifetime have been done to address this problem. We propose a new algorithm to evaluate the node lifetime and the link lifetime utilizing the dynamic nature, such as the energy drain rate and the relative mobility estimation rate of nodes. Integrating these two performance metrics by using the proposed route lifetime-prediction algorithm, we select the least dynamic route with the longest lifetime for persistent data forwarding. Finally, we implement our proposed route lifetime-prediction algorithm in an exploring dynamic nature routing (EDNR) protocol environment based on dynamic source routing (DSR) and compare the performance through simulations. The EDNR protocol outperforms the conventional DSR protocols that are implemented with lifetime-prediction routing (LPR) and signal-stabilitybased adaptive (SSA) routing mechanisms. Keywords–Exploring Dynamic Nature Routing, Lifetime Prediction Routing, Link Lifetime, Vehicular Ad-hoc Network, Wireless Network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Routing Algorithm for Vehicular Ad-hoc Networks based on Glowworm Swarm Optimization Algorithm

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

متن کامل

A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks

In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

A New Multipath AODV Routing Protocol for VANET Based on Expected Link Lifetime

In Vehicular Ad Hoc Networks (VANETs), the node mobility leads to network topology changed frequently. Due to the vehicle movement, the limited wireless resources and channel fading, the routing protocols in Mobile Ad Hoc Networks MANETs are not suitable for VANETs. In this paper we propose a new multipath route protocol based on Ad hoc On-Demand Distance Vector Routing (AODV) for adapting VANE...

متن کامل

An Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs

Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013